Search results for "Circulant matrix"
showing 7 items of 7 documents
Quasi-Newton approach to nonnegative image restorations
2000
Abstract Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform (FFT) based schemes result in efficient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an image consists of positive light intensities, and thus a nonnegativity constraint should be enforced. This constraint and other ways of incorporating a priori information have been suggested in various applications, and can lead to substantial improvements in the reconstructions. Neverth…
Total and fractional total colourings of circulant graphs
2008
International audience; In this paper, the total chromatic number and the fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional total chromatic number and for 4-regular circulant graphs we find the total chromatic number for some cases and we give the exact value of the fractional total chromatic number in most cases.
Versatile Direct and Transpose Matrix Multiplication with Chained Operations: An Optimized Architecture Using Circulant Matrices
2016
With growing demands in real-time control, classification or prediction, algorithms become more complex while low power and small size devices are required. Matrix multiplication (direct or transpose) is common for such computation algorithms. In numerous algorithms, it is also required to perform matrix multiplication repeatedly, where the result of a multiplication is further multiplied again. This work describes a versatile computation procedure and architecture: one of the matrices is stored in internal memory in its circulant form, then, a sequence of direct or transpose multiplications can be performed without timing penalty. The architecture proposes a RAM-ALU block for each matrix c…
Mathematical modelling of problems of mathematical physics with periodic boundary conditions
2014
Darbā izstrādāti jauni speciāli algoritmi parasto un parciālo diferenciālvienādojumu problēmu ar periodiskajiem nosacījumiem skaitliskai modelēšanai, kuri balstās uz precīzā spektra izmantošanu telpisko parciālo atvasinājuma aproksimēšanai ar galīgajām diferencēm. Algoritmi tiek veidoti dažādām divdimensiju matemātiskās fizikas problēmām (lineārām un nelineārām), balstoties uz taišņu metodes algoritmiem un precīzā spektra diferenču shēmām. Izveidotie algoritmi tiek realizēti un salīdzināti ar datorprogrammas MATLAB palīdzību. Ar iegūtajiem algoritmiem tiek risinātas vairākas lietišķas problēmas, t.sk 2D magneto-hidrodinamiska plūsma ap periodiski novietotiem cilindriem, 2D plūsma cilindrā ā…
The irregularity strength of circulant graphs
2005
AbstractThe irregularity strength of a simple graph is the smallest integer k for which there exists a weighting of the edges with positive integers at most k such that all the weighted degrees of the vertices are distinct. In this paper we study the irregularity strength of circulant graphs of degree 4. We find the exact value of the strength for a large family of circulant graphs.
An Scalable matrix computing unit architecture for FPGA and SCUMO user design interface
2019
High dimensional matrix algebra is essential in numerous signal processing and machine learning algorithms. This work describes a scalable square matrix-computing unit designed on the basis of circulant matrices. It optimizes data flow for the computation of any sequence of matrix operations removing the need for data movement for intermediate results, together with the individual matrix operations’ performance in direct or transposed form (the transpose matrix operation only requires a data addressing modification). The allowed matrix operations are: matrix-by-matrix addition, subtraction, dot product and multiplication, matrix-by-vector multiplication, and matrix by scalar multiplication.…
On Mathematical Modelling of Metals Distribution in Peat Layers
2014
In this paper we consider averaging and finite difference methods for solving the 3-D boundary-value problem in multilayered domain. We consider the metals Fe and Ca concentration in the layered peat blocks. Using experimental data the mathematical model for calculation of concentration of metals in different points in peat layers is developed. A specific feature of these problems is that it is necessary to solve the 3-D boundary-value problems for elliptic type partial differential equations (PDEs) of second order with piece-wise diffusion coefficients in the layered domain. We develop here a finite-difference method for solving of a problem of one, two and three peat blocks with periodica…